Defining (reflexive) transitive closure on finite models
نویسنده
چکیده
منابع مشابه
A Tactic for Deciding Kleene Algebras
We present a Coq reflexive tactic for deciding equalities or inequalities in Kleene algebras. This tactic is part of a larger project, whose aim is to provide tools for reasoning about binary relations in Coq: binary relations form a Kleene algebra, where the star operation is the reflexive transitive closure. Our tactic relies on an initiality theorem, whose proof goes by replaying finite auto...
متن کاملExecutable Transitive Closures of Finite Relations
We provide a generic work-list algorithm to compute the transitive closure of finite relations where only successors of newly detected states are generated. This algorithm is then instantiated for lists over arbitrary carriers and red black trees [1] (which are faster but require a linear order on the carrier), respectively. Our formalization was performed as part of the IsaFoR/CeTA project [2]...
متن کاملEmbedding an analytic equivalence relation in the transitive closure of a Borel relation
The transitive closure of a reflexive, symmetric, analytic relation is an analytic equivalence relation. Does some smaller class contain the transitive closure of every reflexive, symmetric, closed relation? An essentially negative answer is provided here. Every analytic equivalence relation on an arbitrary Polish space is Borel embeddable in the transitive closure of the union of two smooth Bo...
متن کاملSets in Coq, Coq in Sets
We present a Coq reflexive tactic for deciding equalities or inequalities in Kleene algebras. This tactic is part of a larger project, whose aim is to provide tools for reasoning about binary relations in Coq: binary relations form a Kleene algebra, where the star operation is the reflexive transitive closure. Our tactic relies on an initiality theorem, whose proof goes by replaying finite auto...
متن کاملTransitive Openings
Though the transitive closure of a reflexive and symmetric fuzzy relation R is unique and there are several algorithms to calculate it, there can be many transitive openings (maximal T -indistinguishability operators among the ones smaller than or equal to R). This paper presents a method to calculate transitive openings of a reflexive and symmetric fuzzy relation R. It is worth noticing that a...
متن کامل